Pure Nash Equilibrium in a Capacitated Selfish Resource Allocation Game
نویسندگان
چکیده
منابع مشابه
Pure Nash Equilibrium in A Capacitated Resource Allocation Game with Binary Preferences
A resource allocation game with identical preferences is considered where each player, as a node of an undirected unweighted network, tries to minimize her cost by caching an appropriate resource. Using a generalized ordinal potential function, a polynomial time algorithm is devised in order to obtain a pure-strategy Nash equilibrium (NE) when the number of resources is limited or the network h...
متن کاملConvergence Time to Nash Equilibrium in Selfish Bin Packing
We consider a game-theoretic bin packing problem and we study the convergence time to a Nash equilibrium. We show that, if the best-response strategy is used, then the number of steps needed to reach Nash equilibrium is O(mw2 max + nwmax) and O(nkwmax), where n, m, k and wmax denotes, resp., the number of items, the number of bins, the number of distinct item sizes, and the size of a largest item.
متن کاملTruthful Resource Allocation in Selfish Sensor Web
Sensor Web, as an extension of Sensor Networks, is expected to be used in the distributed, large-scale environment. With the help of Internet, its application can even be extended to the world wide. And in the distributed environment, a Sensor Web usually consists of different sensor networks or single sensor owned by different organizations such as research institutions, companies or even indi...
متن کاملDiscovering Theorems in Game Theory: Two-Person Games with Unique Pure Nash Equilibrium Payoffs
In this paper we provide a logical framework for using computers to discover theorems in two-person finite games in strategic form, and apply it to discover classes of games that have unique pure Nash equilibrium payoffs. We consider all possible classes of games that can be expressed by a conjunction of two binary clauses, and our program rediscovered Kats and Thisse’s class of weakly unilater...
متن کاملNash Social Welfare in Multiagent Resource Allocation
We study different aspects of the multiagent resource allocation problem when the objective is to find an allocation that maximizes Nash social welfare, the product of the utilities of the individual agents. The Nash solution is an important welfare criterion that combines efficiency and fairness considerations. We show that the problem of finding an optimal outcome is NP-hard for a number of d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Control of Network Systems
سال: 2018
ISSN: 2325-5870
DOI: 10.1109/tcns.2016.2631440